Evaluation of Acceleration Techniques for the Restarted Arnoldi Method
نویسندگان
چکیده
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = λx. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of the restarted Arnoldi iteration on the distribution of spectrum. This research aims to compare this algorithm with other state-of-the-art approaches.
منابع مشابه
Some new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملAnalysis of Accelerating Algorithms for the Restarted Arnoldi Iteration
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = x. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of th...
متن کاملArnoldi-Faber method for large non hermitian eigenvalue problems
We propose a restarted Arnoldi’s method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. A comparison with the implicitly restarted Arnoldi method is also ...
متن کاملImplicitly Restarted Arnoldi Methods and Eigenvalues of the Discretized Navier Stokes Equations
Implicitly restarted Arnoldi methods and eigenvalues of the discretized Navier Stokes equations. Abstract We are concerned with nding a few eigenvalues of the large sparse nonsymmetric generalized eigenvalue problem Ax = Bx that arises in stability studies of incompressible uid ow. The matrices have a block structure that is typical of mixed nite-element discretizations for such problems. We ex...
متن کاملPolynomial Acceleration for Restarted Arnoldi Iteration and its Parallelization
We propose an accelerating method for the restarted Arnoldi iteration to compute a number of eigenvalues of the standard eigenproblem Ax = x and discuss the dependence of the convergence rate of the accelerated iteration on the distribution of spectrum. The e ectiveness of the approach is proved by numerical results. We also propose a new parallelization technique for the nonsymmetric double sh...
متن کامل